0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_int
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify int \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n043.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 17:13:24 CST 2018
0.00/0.21	% done 26 iterations in 0.006s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(subsetI2, axiom,
0.00/0.21	  (subsetI2 <=> (![A,B]: ((![Xx]: (in(Xx,A) => in(Xx,B))) => subset(A,B))))).
0.00/0.21	tff('0', plain,
0.00/0.21	    ![X6, X7]: (in(sk_Xx2(X6, X7), X7) | subset(X7, X6) | ~ subsetI2),
0.00/0.21	    inference('cnf', [status(esa)], [subsetI2])).
0.00/0.21	tff(setminusSubset1, conjecture,
0.00/0.21	  (emptysetE =>
0.00/0.21	   (in__Cong =>
0.00/0.21	    (subsetI2 =>
0.00/0.21	     (setminusI => (![A,B]: ((setminus(A,B) = emptyset) => subset(A,B)))))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (emptysetE =>
0.00/0.21	     (in__Cong =>
0.00/0.21	      (subsetI2 =>
0.00/0.21	       (setminusI => (![A,B]: ((setminus(A,B) = emptyset) => subset(A,B))))))))).
0.00/0.21	tff('1', plain, subsetI2, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('2', plain,
0.00/0.21	    ![X6, X7]: (in(sk_Xx2(X6, X7), X7) | subset(X7, X6) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.21	tff('3', plain, ![X6, X7]: (subset(X7, X6) | in(sk_Xx2(X6, X7), X7)),
0.00/0.21	    inference('simplify', [status(thm)], ['2'])).
0.00/0.21	tff('4', plain, setminus(sk_A3, sk_B3) = emptyset,
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff(setminusI, axiom,
0.00/0.21	  (setminusI <=>
0.00/0.21	   (![A,B,Xx]: (in(Xx,A) => ((~in(Xx,B)) => in(Xx,setminus(A,B))))))).
0.00/0.21	tff('5', plain,
0.00/0.21	    ![X9, X10, X11]:
0.00/0.21	      (~ in(X9, X10) | in(X9, setminus(X10, X11)) | in(X9, X11) | ~ setminusI),
0.00/0.21	    inference('cnf', [status(esa)], [setminusI])).
0.00/0.21	tff('6', plain, setminusI, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('7', plain,
0.00/0.21	    ![X9, X10, X11]:
0.00/0.21	      (~ in(X9, X10) | in(X9, setminus(X10, X11)) | in(X9, X11) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['5', '6'])).
0.00/0.21	tff('8', plain,
0.00/0.21	    ![X9, X10, X11]:
0.00/0.21	      (in(X9, X11) | in(X9, setminus(X10, X11)) | ~ in(X9, X10)),
0.00/0.21	    inference('simplify', [status(thm)], ['7'])).
0.00/0.21	tff('9', plain, ![X0]: (in(X0, emptyset) | ~ in(X0, sk_A3) | in(X0, sk_B3)),
0.00/0.21	    inference('sup+', [status(thm)], ['4', '8'])).
0.00/0.21	tff(emptysetE, axiom,
0.00/0.21	  (emptysetE <=> (![Xx]: (in(Xx,emptyset) => (![Xphi:$o]: Xphi))))).
0.00/0.21	tff('10', plain, ![X0, X1 : $o]: (~ in(X0, emptyset) | X1 | ~ emptysetE),
0.00/0.21	    inference('cnf', [status(esa)], [emptysetE])).
0.00/0.21	tff('11', plain, emptysetE, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('12', plain, ![X0, X1 : $o]: (~ in(X0, emptyset) | X1 | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['10', '11'])).
0.00/0.21	tff('13', plain, ![X0, X1 : $o]: (X1 | ~ in(X0, emptyset)),
0.00/0.21	    inference('simplify', [status(thm)], ['12'])).
0.00/0.21	tff('14', plain, ![X0]: (in(X0, sk_B3) | ~ in(X0, sk_A3)),
0.00/0.21	    inference('clc', [status(thm)], ['9', '13'])).
0.00/0.21	tff('15', plain,
0.00/0.21	    ![X6, X7]: (~ in(sk_Xx2(X6, X7), X6) | subset(X7, X6) | ~ subsetI2),
0.00/0.21	    inference('cnf', [status(esa)], [subsetI2])).
0.00/0.21	tff('16', plain,
0.00/0.21	    ![X6, X7]: (~ in(sk_Xx2(X6, X7), X6) | subset(X7, X6) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['15', '1'])).
0.00/0.21	tff('17', plain, ![X6, X7]: (subset(X7, X6) | ~ in(sk_Xx2(X6, X7), X6)),
0.00/0.21	    inference('simplify', [status(thm)], ['16'])).
0.00/0.21	tff('18', plain,
0.00/0.21	    ![X0]: (~ $true | ~ in(sk_Xx2(sk_B3, X0), sk_A3) | subset(X0, sk_B3)),
0.00/0.21	    inference('sup-', [status(thm)], ['14', '17'])).
0.00/0.21	tff('19', plain, ![X0]: (subset(X0, sk_B3) | ~ in(sk_Xx2(sk_B3, X0), sk_A3)),
0.00/0.21	    inference('simplify', [status(thm)], ['18'])).
0.00/0.21	tff('20', plain, (~ $true | subset(sk_A3, sk_B3) | subset(sk_A3, sk_B3)),
0.00/0.21	    inference('sup-', [status(thm)], ['3', '19'])).
0.00/0.21	tff('21', plain, subset(sk_A3, sk_B3),
0.00/0.21	    inference('simplify', [status(thm)], ['20'])).
0.00/0.21	tff('22', plain, ~ subset(sk_A3, sk_B3),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('23', plain, ~ $true, inference('sup-', [status(thm)], ['21', '22'])).
0.00/0.21	tff('24', plain, $false, inference('simplify', [status(thm)], ['23'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
